Clifford groups of quantum gates, BN-pairs and smooth cubic surfaces
نویسندگان
چکیده
The recent proposal (M Planat and M Kibler, Preprint 0807.3650 [quantph]) of representing Clifford quantum gates in terms of unitary reflections is revisited. In this essay, the geometry of a Clifford group G is expressed as a BN-pair, i.e. a pair of subgroups B and N that generate G, is such that intersection H = B ∩N is normal in G, the group W = N/H is a Coxeter group and two extra axioms are satisfied by the double cosets acting on B. The BN-pair used in this decomposition relies on the swap and match gates already introduced for classically simulating quantum circuits (R Jozsa and A Miyake, Preprint 0804.4050 [quant-ph]). The twoand three-qubit cases are related to the configuration with 27 lines on a smooth cubic surface.
منابع مشابه
Clifford group dipoles and the enactment of Weyl/Coxeter group W (E8) by entangling gates
Peres/Mermin arguments about no-hidden variables in quantummechanics are used for displaying a pair (R,S) of entangling Clifford quantum gates, acting on two qubits. From them, a natural unitary realization of Coxeter/Weyl groups W (D5) and W (F4) emerges, which is also reflected into the splitting of the n-qubit Clifford group Cn into group dipoles C± n . The union of the three-qubit real Clif...
متن کاملUnitary reflection groups for quantum fault tolerance
This paper explores the representation of quantum computing in terms of unitary reflections (unitary transformations that leave invariant a hyperplane of a vector space). The symmetries of qubit systems are found to be supported by Euclidean real reflections (i.e., Coxeter groups) or by specific imprimitive reflection groups, introduced (but not named) in a recent paper [Planat M and Jorrand Ph...
متن کاملFault-tolerant logical gates in quantum error-correcting codes∗
Recently, Bravyi and König have shown that there is a trade-off between fault-tolerantly implementable logical gates and geometric locality of stabilizer codes. They consider locality-preserving operations which are implemented by a constant-depth geometrically-local circuit and are thus fault-tolerant by construction. In particular, they shown that, for local stabilizer codes in D spatial dime...
متن کاملSemi-Clifford and Generalized Semi-Clifford Operations
Fault-tolerant quantum computation is a basic problem in quantum computation, and teleportation is one of the main techniques in this theory. Using teleportation on stabilizer codes, the most well-known quantum codes, Pauli gates and Clifford operators can be applied fault-tolerantly. Indeed, this technique can be generalized for an extended set of gates, the so called Ck hierarchy gates, intro...
متن کاملImproved Classical Simulation of Quantum Circuits Dominated by Clifford Gates.
We present a new algorithm for classical simulation of quantum circuits over the Clifford+T gate set. The runtime of the algorithm is polynomial in the number of qubits and the number of Clifford gates in the circuit but exponential in the number of T gates. The exponential scaling is sufficiently mild that the algorithm can be used in practice to simulate medium-sized quantum circuits dominate...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008